New decision algorithms for finitely presented commutative semigroups
نویسندگان
چکیده
منابع مشابه
Finitely Generated Weakly Reductive Commutative Semigroups∗
We give characterizations of the property of being weakly reductive for finitely generated commutative semigroups. As a consequence of these characterizations we obtain an algorithm for determining from a presentation of a finitely generated commutative semigroup whether it is weakly reductive. Furthermore, we present some connections between cancellative finitely generated commutative semigrou...
متن کاملOn Subsemigroups of Finitely Presented Semigroups
The purpose of this paper is to investigate properties of subsemigroups of finitely presented semigroups, particularly with respect to the property of being finitely presented. More precisely, we will consider various instances of the following: Main Problem. Let S be a finitely presented semigroup. Ž . Ž . i Is every subsemigroup ideal, one-sided ideal of S finitely generated? Ž . Ž . ii Is ev...
متن کاملA Solvable Conjugacy Problem for Finitely Presented C(3) Semigroups
In his thesis, Remmers [R], introduced semigroup derivation diagrams and used them to prove that the word problem for finitely presented C(3) semigroups was solvable. In this article we introduce the annular analog of semigroup derivation diagrams and use them to demonstrate the solution to a conjugacy problem for finitely presented C(3) semigroups. Version of 5-21-2013
متن کاملDecision Problems for Finitely Presented and One-Relation Semigroups and Monoids
For some distinguished properties of semigroups, such as having idempotents, regularity, hopficity etc, we study the following: whether that property or its negation is a Markov property, whether it is decidable for finitely presented semigroups and for one-relation semigroups and monoids. All the results and open problems are summarized in a table.
متن کاملGrowth of Finitely Presented Rees Quotients of Free Inverse Semigroups
We prove that a finitely presented Rees quotient of a free inverse semigroup has polynomial growth if and only if it has bounded height. This occurs if and only if the set of nonzero reduced words has bounded Shirshov height and all nonzero reduced but not cyclically reduced words are nilpotent. This occurs also if and only if the set of nonzero geodesic words have bounded Shirshov height. We a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1981
ISSN: 0898-1221
DOI: 10.1016/0898-1221(81)90115-2